On Some Applications of Finite - State AutomataTheory to Natural Language
نویسنده
چکیده
We describe new applications of the theory of automata to natural language processing: the representation of very large scale dictionaries and the indexation of natural language texts. They are based on new algorithms that we introduce and describe in detail. In particular, we give pseudocodes for the de-terminization of string to string transducers, the deterministic union of p-subsequential string to string transducers, and the indexation by automata. We report several experiments illustrating the applications.
منابع مشابه
A two dimensional Simulation of crack propagation using Adaptive Finite Element Analysis
Finite element method (FEM) is one of the most famous methods which has many applications in varies studies such as the study of crack propagation in engineering structures. However, unless extremely fine meshes are employed, problem arises in accurately modelling the singular stress field in the singular element area around the crack tip. In the present study, the crack growth simulation has b...
متن کاملFinite-State Transducers in Language and Speech Processing
Finite-state machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential string-tostring transducers. Transducers that output weights also play an important role in language and speech processing....
متن کاملApplications of Finite-State Transducers in Natural Language Processing
This paper is a review of some of the major applications of nite-state transducers in natural-language processing ranging from morphological analysis to nite-state parsing. The analysis and generation of in ected word forms can be performed e ciently by means of lexical transducers. Such transducers can be compiled using an extended regular-expression calculus with restriction and replacement o...
متن کاملFinite-state models for speech-based search on mobile devices
In this paper, we present techniques that exploit finite-state models for voice search applications. In particular, we illustrate the use of finite-state models for encoding the search index in order to tightly integrate the speech recognition and the search components of a voice search system. We show that the tight integration mutually benefits Automatic Speech Recognition and improves the se...
متن کاملFinite-State Registered Automata and Their Uses in Natural Languages
We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expressions denote arbitrary FSRAs and use it to describe some morphological and phonological phenomena. We also define several dedicated operators which support an easy and efficient implementation of some non-trivial morph...
متن کامل